Division of trinomials by pentanomials and orthogonal arrays
نویسندگان
چکیده
We consider polynomials over the binary field, F 2. A polynomial f of degree m is called primitive if k = 2 m − 1 is the smallest positive integer such that f divides x k + 1. We consider polynomials over the binary field, F 2. A polynomial f of degree m is called primitive if k = 2 m − 1 is the smallest positive integer such that f divides x k + 1.
منابع مشابه
Divisibility of polynomials over finite fields and combinatorial applications
Consider a maximum-length shift-register sequence generated by a primitive polynomial f over a finite field. The set of its subintervals is a linear code whose dual code is formed by all polynomials divisible by f . Since the minimum weight of dual codes is directly related to the strength of the corresponding orthogonal arrays, we can produce orthogonal arrays by studying divisibility of polyn...
متن کاملDivision of Trinomials by Pentanomials over F2 and Orthogonal Arrays
Let C f n denote the set of all subintervals of a binary shift-register sequence with length n generated by a primitive polynomial f of degree m, where m< n≤ 2m, together with the zero vector of length n. Munemasa [8] showed that if the polynomial f is a trinomial, then C f n corresponds to an orthogonal array of strength 2. His result is based on a proof that very few trinomials of degree at m...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملLow-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach
Recently, the multipliers with subquadratic space complexity for trinomials and some specific pentanomials have been proposed. For such kind of multipliers, alternatively, we use double basis multiplication which combines the polynomial basis and the modified polynomial basis to develop a new efficient digit-serial systolic multiplier. The proposed multiplier depends on trinomials and almost eq...
متن کاملThe parity of the number of irreducible factors for some pentanomials
It is well known that Stickelberger-Swan theorem is very important for determining reducibility of polynomials over a binary field. Using this theorem it was determined the parity of the number of irreducible factors for some kinds of polynomials over a binary field, for instance, trinomials, tetranomials, self-reciprocal polynomials and so on. We discuss this problem for type II pentanomials n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 45 شماره
صفحات -
تاریخ انتشار 2007